On α-resolvable directed cycle systems for cycle length 4
نویسندگان
چکیده
A directedm-cycle system of order v with index λ, denotedm-DCS(v, λ), is a collection of directed cycles of length m whose directed edges partition the directed edges of λDKv. An m-DCS(v, λ) is α-resolvable if its directed cycles can be partitioned into classes such that each point of the design occurs in precisely α cycles in each class. The necessary conditions for the existence of such a design are m | αv and α | λ(v−1). It is shown in this paper that these conditions are also sufficient when m = 4, except for the case v = 4, λ ≡ 1 (mod 2).
منابع مشابه
Existence of almost resolvable directed 5-cycle systems
A directed k-cycle system of order n is a pair ( S, T ), where S is an n-set and T is a collection of arc disjoint directed k-cycles that partition the complete directed graph Kn *. An almost parallel class with deficiency x is a set of directed k-cycles which form a partition of S \ {x}. An almost resolvable directed k-cyclc system is a directed k-cyclc system in which the cycles can be partit...
متن کاملOn the Directed Oberwolfach Problem with Equal Cycle Lengths
We examine the necessary and sufficient conditions for a complete symmetric digraph K n to admit a resolvable decomposition into directed cycles of length m. We give a complete solution for even m, and a partial solution for odd m.
متن کاملDirected cyclic Hamiltonian cycle systems of the complete symmetric digraph
In this paper, we prove that directed cyclic hamiltonian cycle systems of the complete symmetric digraph, K∗ n, exist if and only if n ≡ 2 (mod 4) and n 6= 2p with p prime and α ≥ 1. We also show that directed cyclic hamiltonian cycle systems of the complete symmetric digraph minus a set of n/2 vertex-independent digons, (Kn− I)∗, exist if and only if n ≡ 0 (mod 4).
متن کاملروابط جدید زمان چرخه بهینه برای تقاطعهای پیشزمانبندی شده مستقل با تغییر رابطه وبستر براساس روش HCM 2000
When the degree of saturation at intersection approaches one, Webster’s optimum cycle length equation becomes inapplicable, because the cycle length will becomes very big when the degree of saturation approaches one and will be fully unrealistic when the degree of saturation becomes greater than one. This is not a problem for HCM2000 method. But optimum cycle length calculation in this method h...
متن کاملar X iv : c on d - m at / 0 50 64 93 v 1 2 0 Ju n 20 05 Statistics of cycles in large networks
We present a Markov Chain Monte Carlo method for sampling cycle length in large graphs. Cycles are treated as microstates of a system with many degrees of freedom. Cycle length corresponds to energy such that the length histogram is obtained as the density of states from Metropolis sampling. In many growing networks, mean cycle length increases algebraically with system size. The cycle exponent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 46 شماره
صفحات -
تاریخ انتشار 2010